package leetcode.weekly.week330;

import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;

//Solution1Test
public class Solution11 {
	public int distinctIntegers(int n) {
		return n == 1 ? 1 : n - 1;
	}

}
